|
Solving chess means finding an optimal strategy for playing chess, i.e. one by which one of the players (White or Black) can always force a victory, or both can force a draw (see Solved game). According to Zermelo's theorem, a hypothetically determinable optimal strategy does exist for chess. In a weaker sense, ''solving chess'' may refer to a proof which of the three possible outcomes (White wins; Black wins; draw) is the result of two perfect players, without necessarily revealing the optimal strategy itself (see indirect proof).〔 〕 No complete solution for chess in either of the two senses is known, nor is it expected that chess will be solved in the near future. There is disagreement on whether the current exponential growth of computing power will continue long enough to someday allow for solving it by "brute force", i.e. by checking all possibilities. ==Partial results== Endgame tablebases have solved chess to a limited degree, determining perfect play in a number of endgames, including all non-trivial endgames with no more than seven pieces or pawns (including the two kings).〔 (【引用サイトリンク】url=http://chessok.com/?page_id=27966 )〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Solving chess」の詳細全文を読む スポンサード リンク
|